Transaction-Time Indexing

نویسندگان

  • Mirella M. Moro
  • Vassilis J. Tsotras
چکیده

DEFINITION A transaction-time index is a temporal index that enables fast access to transaction-time datasets. In a traditional database, an index is used for selection queries. When accessing transaction-time databases, selection queries also involve the transaction-time dimension. The characteristics of the transaction-time axis imply various properties that such temporal index should have to be efficient. As with traditional indices, the performance is described by three costs: (i) storage cost (i.e., the number of pages the index occupies on the disk), (ii) update cost (the number of pages accessed to perform an update on the index; for example when adding, deleting or updating a record) and (iii) query cost (the number of pages accessed for the index to answer a query).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proposal for Indexing Bitemporal Databases via Cooperative B+-trees

In this paper we propose an indexing structure for bitemporal databases. Such structure is based on two trees, one indexing valid time and another indexing transaction time. The trees share pointers to the actual data records, which are thus not duplicated. Bitemporal queries are processed by dividing the query in two parts, a valid time part and a transaction time part. Each tree is searched a...

متن کامل

Index Structures for Temporal and Multimedia Databases

by TOLGA BOZKAYA This thesis proposes index structures for efficient evaluation of temporal queries in temporal databases and similarity based queries in multimedia databases. To support temporal operators and to increase the efficiency of temporal queries, indexing based on temporal attributes is required. A temporal database can support two notions of time. Valid time is the time when a data ...

متن کامل

An Efficient Technique for Indexing Temporal Databases

Temporal databases added a new dimension to traditional transaction databases. This dimension is the life time of each item, i.e. exhibition period, starting from the partition when this item appears in the transaction database to the partition when this item no longer exists. Mining temporal association rules became very interesting topic in many applications nowadays. In this paper, an effici...

متن کامل

Transaction time indexing with version compression

Immortal DB is a transaction time database system designed to enable high performance for temporal applications. It is built into a commercial database engine, Microsoft SQL Server. This paper describes how we integrated a temporal indexing technique, the TSB-tree, into Immortal DB to serve as the core access method. The TSB-tree provides high performance access and update for both current and ...

متن کامل

R-Tree Based Indexing of General Spatio-Temporal Data

Real-world objects are inherently spatially and temporally referenced, and many database applications rely on databases that record the past, present, and anticipated future locations of, e.g., people or land parcels. As a result, indices that efficiently support queries on the spatio-temporal extents of objects are needed. In contrast, past indexing research has progressed in largely separate ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009